Multi-Depot Joint Distribution Vehicle Routing Problem Considering Energy Consumption with Time-Dependent Networks

This paper studies the multi-depot joint distribution vehicle routing problem considering energy consumption with time-dependent networks (MDJDVRP-TDN). Aiming at where travel time depends on variation characteristics of road network speed in area, influence and relationship between load fuel consumption, a optimization model is established to minimize sum fixed cost, cost window penalty cost. Traditional problems are modeled based symmetric graphs. In this paper, routes optimization, modeling asymmetric graphs, which increases complexity problem. A hybrid genetic algorithm variable neighborhood search (HGAVNS) designed solve model, nearest neighbor insertion method Logistic mapping equation used generate initial solution firstly, then five structures improve algorithm. An adaptive times strategy balance diversification depth population. The effectiveness verified through several groups numerical instances different scales. research can enrich relevant theoretical provide basis for transportation enterprises formulate reasonable schemes.